Stable Incremental Layouts for Dynamic Graph Visualizations
نویسندگان
چکیده
In this paper we present a set of extension techniques to stabilize interactive dynamic graph layout algorithms. It works with different existing Focus & Context methods. We first deal with the initial placement of newly inserted nodes to mitigate acting forces in the layout algorithm. Then, their influence on the existing layout is gradually increased to create a smooth transition between the old and the new layout. To complement this approach we use a look-ahead strategy that integrates additional nodes in the layout to stabilize the layout even more. Our approach is validated using both quantitative and qualitative measures.
منابع مشابه
Online Hierarchical Graph Drawing
We propose a heuristic for maintaining dynamic hierarchical graph layouts. The heuristic is an on-line interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are both incrementally stable and readable through long editing sequences. We present measurements of an experim...
متن کاملVisualizing the Temporal Evolution of Dynamic Networks
Many developments have recently been made in mining dynamic networks; however, effective visualization of dynamic networks remains a significant challenge. Dynamic networks are typically visualized via a sequence of static graph layouts. In addition to providing a visual representation of the network topology at each time step, the sequence should preserve the “mental map” between layouts of co...
متن کاملUsing Layout Stitching to create Deterministic Local Graph Layouts
Dynamic graph layouts are often used to position nodes in local views of large graphs. These layouts can be optimized to minimize changes when navigating to other parts of the graph. Dynamic graph layout techniques do not, however, guarantee that a local layout is recognizable when the user visits the same area twice. In this paper we present a method to create stable and deterministic layouts ...
متن کاملAgent-Based Annotation of Interactive 3D Visualizations
This paper presents a novel real-time algorithm to integrate internal and external labels of arbitrary size into 3D visualizations. Moreover, comprehensive dynamic content can be displayed in annotation boxes. Our system employs multiple metrics in order to achieve an effective and aesthetic label layout with adjustable weights. The layout algorithm employs several heuristics to reduce the sear...
متن کاملAdaptive Surface Reconstruction for SPH using 3-Level Uniform Grids
Dynamic graph layouts are often used to position nodes in local views of large graphs. These layouts can be optimized to minimize changes when navigating to other parts of the graph. Dynamic graph layout techniques do not, however, guarantee that a local layout is recognizable when the user visits the same area twice. In this paper we present a method to create stable and deterministic layouts ...
متن کامل